Joint column generation and Lagrangian relaxation technique for incident respondent location and allocation

نویسندگان

چکیده

Incident response operations require effective planning of resources to ensure timely clearance roadways and avoidance secondary incidents. This study formulates a mixed-integer linear program minimize the total expected travel time maximize demand covered. The model accounts for location, severity, frequency incidents, dispatching locations, availability incident respondents. An integrated methodology that includes column generation Lagrangian relaxation with density-based clustering technique defines hot spots is proposed. hybrid approach applied an empirical case in Raleigh, NC. A network instance 10,672 sites, clustered search distance (ε) 5 min, solved efficiently optimality gap 1.37% 2 min. Benders decomposition implemented conduct benchmark analyses. numerical results suggest proposed algorithm can solve problem outperform solutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lagrangian relaxation and constraint generation for allocation and advanced scheduling

Diverse applications in manufacturing, logistics, health care, telecommunications, and computing require that renewable resources be dynamically scheduled to handle distinct classes of job service requests arriving randomly over slotted time. These dynamic stochastic resource scheduling problems are analytically and computationally intractable even when the number of job classes is relatively s...

متن کامل

Reformulation, Column Generation and Lagrangian Relaxation for Local Access Network Design Problems

In this paper, we present several models of Local Access Network Design and Expansion problems, and discuss different alternatives for solving these problems, as well as the relationships among different approaches. One of our results shows that both Design and Expansion problems provide examples for a rare situation in which the lower bound from Lagrangian relaxation is exactly equal to the op...

متن کامل

Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation

We summarize our experience in solving combinatorial optimization problems arising in railway planning, illustrating all of these problems as integer multicommodity flow ones and discussing the main features of the mathematical programming models that were successfully used in the 1990s and in recent years to solve them. 1998 ACM Subject Classification G.2.2 Graph Theory, Network problems; G.2....

متن کامل

Slot Allocation by Column Generation

A slot allocation policy assigns a time slot for departure to each of a number of flights in order to avoid overload in control sectors and on runways. We present a new solution method for a basic version of the European slot allocation problem. The approach is based on an integer linear programming model, where for each flight there is a set of 0-1 variables each associated with one of its pos...

متن کامل

a benchmarking approach to optimal asset allocation for insurers and pension funds

uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer-aided Civil and Infrastructure Engineering

سال: 2023

ISSN: ['1093-9687', '1467-8667']

DOI: https://doi.org/10.1111/mice.13016